A New Inference Axiom for Probabilistic Conditional Independence
نویسندگان
چکیده
In this paper, we present a hypergraph-based inference method for conditional independence. Our method allows us to obtain several interesting results on graph combination. In particular, our hypergraph approach allows us to strengthen one result obtained in a conventional graph-based approach. We also introduce a new inference axiom, called combination, of which the contraction axiom is a special case.
منابع مشابه
Conditional products: An alternative approach to conditional independence
We introduce a new abstract approach to the study of conditional independence, founded on a concept analogous to the factoriza-tion properties of probabilistic independence, rather than the separation properties of a graph. The basic ingredient is the \con-ditional product", which provides a way of combining the objects under consideration while preserving as much independence as possible. We i...
متن کاملTractability through Exchangeability: A New Perspective on Efficient Probabilistic Inference [Highlight on Published Work]
Exchangeability is a central notion in statistics and probability theory. The assumption that an infinite sequence of data points is exchangeable is at the core of Bayesian statistics. However, finite exchangeability as a statistical property that renders probabilistic inference tractable is less well-understood. We develop a theory of finite exchangeability and its relation to tractable probab...
متن کاملTractability through Exchangeability: A New Perspective on Efficient Probabilistic Inference
Exchangeability is a central notion in statistics and probability theory. The assumption that an infinite sequence of data points is exchangeable is at the core of Bayesian statistics. However, finite exchangeability as a statistical property that renders probabilistic inference tractable is less well-understood. We develop a theory of finite exchangeability and its relation to tractable probab...
متن کاملGeneralized Conditional Independence and Decomposition Cognizant Curvature: Implications for Function Optimization
We introduce conditional independence for real-valued set functions which generalizes probabilistic conditional independence. We show that a natural semantics of conditional independence is that of local modularity. Generalized conditional independence leads to a spectrum between two extremes: modular functions and functions without any local modularity. We develop a decomposition theory and re...
متن کاملA Graph-Based Inference Method for Conditional Independence
The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 1988]. Such axioms provide a mechanism for manipulating conditional independence assertions without resorting to their numerical definition. This paper explores a representation for independence statements using multiple undirected graphs and some simple gra...
متن کامل